Nuprl Lemma : cons-seq_wf
11,40
postcript
pdf
T
:Type,
k
:
,
x
:
T
,
s
:({0..
k
}
T
). cons-seq(
x
;
s
)
{0..(
k
+1)
}
T
latex
Definitions
x
:
A
.
B
(
x
)
,
,
{
i
..
j
}
,
t
T
,
cons-seq(
x
;
s
)
,
if
b
then
t
else
f
fi
,
P
Q
,
tt
,
,
P
&
Q
,
ff
,
A
,
i
j
<
k
,
A
B
,
False
,
,
Unit
,
P
Q
,
Lemmas
bool
wf
,
iff
transitivity
,
assert
wf
,
eqtt
to
assert
,
assert
of
eq
int
,
bnot
wf
,
not
wf
,
eqff
to
assert
,
assert
of
bnot
,
not
functionality
wrt
iff
,
le
wf
,
int
seg
wf
origin